package com.example.leetcode.leetcode;

import java.util.Queue;
import com.example.leetcode.leetcode.tree.TreeNode;
/**
 * @author zht
 * @date 2021/1/14 11:39
 *     1
 *    / \
 *   2   5
 *  / \   \
 * 3   4   6
 */
public class Solution114 {

    public void flatten(TreeNode root) {

    }

    public void bfs(TreeNode root, Queue <TreeNode> queue){

    }

}
